Fast Point Multiplication on Elliptic Curves without Precomputation
نویسنده
چکیده
Elliptic curves find numerous applications. This paper describes a simple strategy to speed up their arithmetic in right-to-left methods. In certain settings, this leads to a non-negligible performance increase compared to the left-to-right counterparts.
منابع مشابه
Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
In this paper we introduce new methods for computing constant-time variable-base point multiplications over the Galbraith-Lin-Scott (GLS) and the Koblitz families of elliptic curves. Using a left-to-right double-and-add and a right-to-left halve-and-add Montgomery ladder over a GLS curve, we present some of the fastest timings yet reported in the literature for point multiplication. In addition...
متن کاملImproved Algorithms for Arithmetic on Anomalous Binary Curves ?
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over nite elds. The basic operation is scalar multiplication: taking a given integer multiple of a given point on the curve. The cost of the protocols depends on that of the elliptic scalar multiplication operation. Koblitz introduced a family of curves which admit especially fast ell...
متن کاملEfficient Arithmetic on Koblitz Curves
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: taking a given integer multiple of a given point on the curve. The cost of the protocols depends on that of the elliptic scalar multiplication operation. Koblitz introduced a family of curves which admit especially fast...
متن کاملFaster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have therefore proposed to perform a scalar multiplication by an “halve-and-add” algorithm, which is faster than the classical double-and-add method. If the coefficients of the equation defining the curve lie in a small subf...
متن کاملCOMPARISON OF ALGORITHMS FOR ELLIPTIC CURVE CRYPTOGRAPHY OVER FINITE FIELDS OF GF(2m)
For elliptic curve cryptosystems does exist many algorithms, that computes the scalar multiplication k·P. Some are better for a software solution and others are better for a hardware solution. In this paper we compare algorithms without precomputation for the scalar multiplication on elliptic curves over a finite field of GF(2). At the end we show which algorithm is the best for a hardware or s...
متن کامل